11111

COURSE INTRODUCTION AND APPLICATION INFORMATION


ce.cs.ieu.edu.tr

Course Name
Code
Semester
Theory
(hour/week)
Application/Lab
(hour/week)
Local Credits
ECTS
Spring
Prerequisites
 CE 215To succeed (To get a grade of at least DD)
Course Language
Course Type
Required
Course Level
-
Mode of Delivery -
Teaching Methods and Techniques of the Course Discussion
Problem Solving
Q&A
Critique
Course Coordinator
Course Lecturer(s)
Assistant(s) -
Course Objectives
Learning Outcomes The students who succeeded in this course;
  • be able to apply languages of strings to specify decision problems
  • be able to design deterministic and nondeterministic automata recognising given languages
  • be able to convert a nondeterministic automaton into a deterministic automaton recognising the same language
  • be able to convert a regular expression into a nondeterministic automaton
  • be able to use the pumping lemma that a language is not regular
  • be able to use pushdown automata
  • be able to construct Turing machines
Course Description

 



Course Category

Core Courses
X
Major Area Courses
Supportive Courses
Media and Managment Skills Courses
Transferable Skill Courses

 

WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week Subjects Required Materials
1 Deterministic finite automata Chapter 1. Sections 1.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
2 Deterministic finite automata Chapter 1. Sections 1.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
3 Nondeterministic finite automata Chapter 1. Sections 1.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
4 Regular expressions Chapter 1. Sections 1.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
5 Contextfree grammars Chapter 2. Sections 2.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
6 Pushdown automata Chapter 2. Sections 2.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
7 Midterm# 1
8 Turing machines Chapter 3. Sections 3.1. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
9 Turing machines Chapter 3. Sections 3.2, 3.3. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
10 COMPUTABILITY and COMPLEXITY Chapter 7. Sections 7.2. Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
11 Midterm #2
12 Application of FA
13 Minimization of DFA
14 Compiler
15 Review of the Semester  
16 Review of the Semester  
Course Notes/Textbooks Introduction to the theory of computation. Michael Sipser. ISBN 053494728X
Suggested Readings/Materials

 

EVALUATION SYSTEM

Semester Activities Number Weigthing
Participation
Laboratory / Application
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exam
Midterm
2
60
Final Exam
1
40
Total

Weighting of Semester Activities on the Final Grade
60
Weighting of End-of-Semester Activities on the Final Grade
40
Total

ECTS / WORKLOAD TABLE

Semester Activities Number Duration (Hours) Workload
Course Hours
(Including exam week: 16 x total hours)
16
3
48
Laboratory / Application Hours
(Including exam week: 16 x total hours)
16
Study Hours Out of Class
15
4
Field Work
Quizzes / Studio Critiques
Portfolio
Homework / Assignments
Presentation / Jury
Project
Seminar / Workshop
Oral Exam
Midterms
2
13
Final Exams
1
16
    Total
150

 

COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP

#
Program Competencies/Outcomes
* Contribution Level
1
2
3
4
5
1

Adequate knowledge in Mathematics, Science and Computer Engineering; ability to use theoretical and applied information in these areas to model and solve Computer Engineering problems

X
2

Ability to identify, define, formulate, and solve complex Computer Engineering problems; ability to select and apply proper analysis and modeling methods for this purpose

X
3

Ability to design a complex computer based system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose

X
4

Ability to devise, select, and use modern techniques and tools needed for Computer Engineering practice

X
5

Ability to design and conduct experiments, gather data, analyze and interpret results for investigating Computer Engineering problems

X
6

Ability to work efficiently in Computer Engineering disciplinary and multi-disciplinary teams; ability to work individually

X
7

Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of two foreign languages

X
8

Recognition of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself

X
9

Awareness of professional and ethical responsibility

X
10

Information about business life practices such as project management, risk management, and change management; awareness of entrepreneurship, innovation, and sustainable development

X
11

Knowledge about contemporary issues and the global and societal effects of engineering practices on health, environment, and safety; awareness of the legal consequences of Computer Engineering solutions

X

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest

 

İzmir Ekonomi Üniversitesi | Sakarya Caddesi No:156, 35330 Balçova - İZMİR Tel: +90 232 279 25 25 | webmaster@ieu.edu.tr | YBS 2010